Interior point approach for convex quadratic programming 凸二次规划问题的内点算法
A dual method for solving a class of convex quadratic programs 一类凸二次规划的对偶方法
Predictor-corrector smoothing methods for convex quadratic programs 凸二次规划的预估校正光滑算法
An interior point algorithm for convex quadratic programming problem with box constraints 框式约束凸二次规划问题的内点算法
A controllable scheduling problem with discrete processing times using convex quadratic programming relaxation 凸二次规划松弛方法研究离散加工时间可控排序问题
When the hessian is positive definite, the qp subproblem is a strict convex quadratic programming 若qp子问题的hessian阵正定,则它是一个严格凸二次规划问题。
Fifthly, the parameter control methods for solving convex programming, especially linear programming and convex quadratic programming, are discussed and its convergence iv is probed 五是研究了凸规划包括线性规划和凸二次规划的参数控制算法及其收敛性。
In order to improve the efficiency of the algorithm, we not only correct some defects of the primal-dual interior point algorithm in [ 4 ], but also give a modified primal-dual interior point algorithm for convex quadratic programming problem with box constraints 为提高算法的有效性,对文[4]所给的原始-对偶内点算法理论上的某些缺陷加以更正,并给出框式约束凸二次规划问题的一个修正原始-对偶内点算法。
The methods employs solving convex quadratic programming directly or solving convex quadratic programming after converting the large-scale problem into many sub-problem or utilizing sophisticated optimization techniques after converting the constrained optimization problem into unconstrained ones 这些方法是通过求解凸二次规划问题或将大规模问题转化成若干子问题再求解凸二次规划问题,或者是转化为无约束最优化问题再利用比较成熟的最优化方法求解。
The methods employs solving convex quadratic programming directly or solving convex quadratic programming after converting the large-scale problem into many sub-problem or utilizing sophisticated optimization techniques after converting the constrained optimization problem into unconstrained ones 这些方法是通过求解凸二次规划问题或将大规模问题转化成若干子问题再求解凸二次规划问题,或者是转化为无约束最优化问题再利用比较成熟的最优化方法求解。